Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets
نویسندگان
چکیده
منابع مشابه
Capacity and Achievable Rate Regions for Linear Network Coding over Ring Alphabets
The rate of a network code is the ratio of the block size of the network’s messages to that of its edge codewords. We compare the linear capacities and achievable rate regions of networks using finite field alphabets to the more general cases of arbitrary ring and module alphabets. For non-commutative rings, two-sided linearity is allowed. Specifically, we prove the following for directed acycl...
متن کاملLinear Capacity of Networks over Ring Alphabets
The rate of a network code is the ratio of the block sizes of the network’s messages and its edge codewords. The linear capacity of a network over a finite ring alphabet is the supremum of achievable rates using linear codes over the ring. We prove the following for directed acyclic networks: (i) For every finite field F and every finite ring R, there is some network whose linear capacity over ...
متن کاملOn Network Coding Capacity - Matroidal Networks and Network Capacity Regions
One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity regions. In our matroidal approach, we prove the converse of the theorem which states that, if a network is scalar-linearly solvable then it is a matroidal ...
متن کاملAchievable Rate Regions Using Novel Location Assisted Coding (LAC)
The recent increase in number of wireless devices has been driven by the growing markets of smart homes and the Internet of Things (IoT). As a result, expanding and/or efficient utilization of the radio frequency (RF) spectrum is critical to accommodate such an increase in wireless bandwidth. Alternatively, recent free-space optical (FSO) communication technologies have demonstrated the feasibi...
متن کاملNetwork Coding with Two-Way Relaying: Achievable Rate Regions and Diversity-Multiplexing Tradeoffs
This paper addresses the fundamental characteristics of information exchange via multihop network coding over two-way relaying in a wireless ad hoc network. The end-to-end rate regions achieved by timedivision multihop (TDMH), MAC-layer network coding (MLNC) and PHY-layer network coding (PLNC) are first characterized. It is shown that MLNC does not always achieve better rates than TDMH, time sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2019
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2866244